Achievability of the Rate ${1/2}\log(1+\es)$ in the Discrete-Time Poisson Channel

نویسنده

  • Alfonso Martinez
چکیده

A simple lower bound to the capacity of the discrete-time Poisson channel with average energy εs is derived. The rate 12 log(1+εs) is shown to be the generalized mutual information of a modified minimum-distance decoder, when the input follows a gamma distribution of parameter 1/2 and mean εs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EE360 project: Interference Alignment for MIMO interference channel using Imperfect CSI

Interference alignment is a novel technique introduced in [1] that allows for K/2 degrees of freedom in a K-user interference channel. A related work [2] proves the achievability of 4/3 degrees of freedom on the 2 user MIMO-X channel. However, the techniques require Channel State Information (CSI) at transmitter. In [3], it is shown that M(L− 1) log P bits of feedback broadcased by each Rx to a...

متن کامل

An achievable rate region for the broadcast channel

Let p( yl, y2 1 X) denote a discrete memoryless channel with a single source X and two independent receivers YI and Y2. W e exhibit an achievable region of rates (R11,R12,R22) at which independent information can be sent, respectively, to receiver 1, to both receivers 1 and 2, and to receiver 2. The achievability of the region is shown by using a version of the asymptotic equipartit ion propert...

متن کامل

Low-Signal-Energy Asymptotics of Capacity and Mutual Information for the Discrete-Time Poisson Channel

The first terms of the low-signal-energy asymptotics for the mutual information in the discrete-time Poisson channel are derived and compared to an asymptotic expression of the capacity. In the presence of non-zero additive noise (either Poisson or geometric), the mutual information is concave at zero signal-energy and the minimum energy per bit is not attained at zero capacity. Fixed signal co...

متن کامل

An Alternative Proof of the Rate-Distortion Function of Poisson Processes with a Queueing Distortion Measure

This paper presents a proof of the rate distortion function of a Poisson process with a queuing distortion measure that is in complete analogy with the proofs associated with the rate distortion functions of a Bernoulli source with Hamming distortion measure and a Gaussian source with squared-error distortion measure. Analogous to those problems, the distortion measure that we consider is relat...

متن کامل

On Achievability via Random Binning

In [1], the authors present a novel tool to establish achievability results in network information theoretic problems. The main idea is to study a set of discrete memoryless correlated sources, and the ensuing statistics of the bin indices resulting from random binning of the sources. Sufficient conditions are established on rates of random binning such that these indices are mutually independe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0809.3370  شماره 

صفحات  -

تاریخ انتشار 2008